Combinatorial analysis of quicksort algorithm
نویسندگان
چکیده
منابع مشابه
Combinatorial Analysis of Quicksort Algorithm
We study probability distributions of several characteristic parameters on various forms of Quicksort algorithm: median-of-k, cutting of small lists. A constant use of generating functions leads to a more synthetic description and analysis of the combinatorial structure of the algorithm. This approach allows us in particular to extend the known results for the distributions of running times. We...
متن کاملQuicksort Algorithm Again Revisited
We consider the standard Quicksort algorithm that sorts n distinct keys with all possible n! orderings of keys being equally likely. Equivalently, we analyze the total path length n in a randomly built binary search tree. Obtaining the limiting distribution of n is still an outstanding open problem. In this paper, we establish an integral equation for the probability density of the number of co...
متن کاملEnhanced Quicksort Algorithm
Sorting is considered as one of the important issues of computer science. Although there is a huge number of sorting algorithms, sorting problem has attracted a great deal of research; because efficient sorting is important to optimize the use of other algorithms. It is also often in producing human-readable output. This paper presents a new sorting algorithm called SMS-algorithm (Scan, Move, a...
متن کاملA Practical Quicksort Algorithm for Graphics Processors
In this paper we present GPU-Quicksort, an efficient Quicksort algorithm suitable for highly parallel multi-core graphics processors. Quicksort has previously been considered as an inefficient sorting solution for graphics processors, but we show that GPU-Quicksort often performs better than the fastest known sorting implementations for graphics processors, such as radix and bitonic sort. Quick...
متن کاملThe Quicksort algorithm and related topics
Sorting algorithms have attracted a great deal of attention and study, as they have numerous applications to Mathematics, Computer Science and related fields. In this thesis, we first deal with the mathematical analysis of the Quicksort algorithm and its variants. Specifically, we study the time complexity of the algorithm and we provide a complete demonstration of the variance of the number of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 1989
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/1989230303171